Comparing Evolutionary Strategies on a Biobjective Cultural Algorithm
نویسندگان
چکیده
منابع مشابه
Comparing Evolutionary Strategies on a Biobjective Cultural Algorithm
Evolutionary algorithms have been widely used to solve large and complex optimisation problems. Cultural algorithms (CAs) are evolutionary algorithms that have been used to solve both single and, to a less extent, multiobjective optimisation problems. In order to solve these optimisation problems, CAs make use of different strategies such as normative knowledge, historical knowledge, circumstan...
متن کاملEvolutionary multiobjective optimization using a cultural algorithm
In this paper, we present the first proposal to use a cultural algorithm to solve multiobjective optimization problems. Our proposal uses evolutionary programming, Pareto ranking and elitism (i.e., an external population). The approach proposed is validated using several examples taken from the specialized literature. Our results are compared with respect to the NSGA-II, which is an algorithm r...
متن کاملA Granular Evolutionary Algorithm Based on Cultural Evolution
Analogous to biological evolution, cultural evolution also is a kind of optimal mechanism of nature. Studying this mechanism might possibly provide a more efficient computation for solving complicated problems, such as knowledge acquisition in large data set. In this paper, an algorithm, granular evolutionary algorithm for data classification, simply written as GEA, is proposed based on cultura...
متن کاملComparing strategies to preserve evolutionary diversity.
The likely future extinction of various species will result in a decline of two quantities: species richness and phylogenetic diversity (PD, or 'evolutionary history'). Under a simple stochastic model of extinction, we can estimate the expected loss of these quantities under two conservation strategies: An 'egalitarian' approach, which reduces the extinction risk of all species, and a 'targeted...
متن کاملAn Improved Algorithm for Biobjective Integer Programs
A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/745921